NP-complete problems

Results: 1536



#Item
11Logic puzzles / NP-complete problems / Puzzles / Mathematics / Leisure / Recreational mathematics / Sudoku / Logic / Crossword / Cryptic crossword / Mathematical puzzle / Mathematics of Sudoku

SOLVING SUDOKU by Michael Mepham What is sudoku?

Add to Reading List

Source URL: www.cluemaster.com

Language: English - Date: 2009-09-22 21:02:34
12Mathematics / Operations research / Computational complexity theory / Applied mathematics / Mathematical optimization / NP-complete problems / Cybernetics / Heuristics / Hyper-heuristic / Genetic algorithm / Travelling salesman problem / Evolutionary algorithm

Thursday 31 March EvoCOP 1 - Real World Applications, 11:30-13:10 Chaired by Francisco Chicano Particle Swarm Optimization for Multi-Objective Web Service Location Allocation,

Add to Reading List

Source URL: www.evostar.org

Language: English - Date: 2016-03-15 10:32:14
13Mathematics / Computational complexity theory / Algebra / NP-complete problems / Analysis of algorithms / Set cover problem / Bin packing problem / Linear programming relaxation / Vertex cover / Ring / Exponentiation / Big O notation

Set Covering with Ordered Replacement: Additive and Multiplicative Gaps Friedrich Eisenbrand1 , Naonori Kakimura?2 , Thomas Rothvoß??1 , and Laura Sanità? ? ?1 1

Add to Reading List

Source URL: www.math.washington.edu

Language: English - Date: 2013-11-01 17:11:52
14Graph theory / NP-complete problems / Graph coloring / Dominating set / Graph / Chordal graph / Pathwidth / Trapezoid graph

New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs∗ Archontia C. Giannopoulou and George B. Mertzios School of Engineering and Computing Sciences, Durham University, UK archont

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2015-03-12 21:45:21
15Theoretical computer science / Robot kinematics / Constraint programming / NP-complete problems / Motion planning / Pursuit-evasion / Satisfiability modulo theories / Automated planning and scheduling / Liveness

International Conference on Automated Planning and Scheduling (ICAPSTask and Motion Policy Synthesis as Liveness Games Yue Wang and Neil T. Dantam and Swarat Chaudhuri and Lydia E. Kavraki Department of Computer

Add to Reading List

Source URL: www.neil.dantam.name

Language: English - Date: 2016-07-08 17:59:42
16Graph theory / Mathematics / Bioinformatics / NP-complete problems / Computational biology / DNA sequencing / K-mer / Velvet assembler / Eulerian path / Hamiltonian path / Degree / Seven Bridges of Knigsberg

How to apply de Bruijn graphs to genome assembly

Add to Reading List

Source URL: www.nature.com

Language: English - Date: 2012-01-20 11:24:28
17Graph theory / NP-complete problems / Graph operations / Line graph / Cograph / Clique / Neighbourhood / Matching / Hypergraph / Independent set / Graph / Dominating set

Finding Four-Node Subgraphs in Triangle Time Virginia Vassilevska Williams∗ Joshua R. Wang† Abstract

Add to Reading List

Source URL: web.stanford.edu

Language: English - Date: 2014-12-26 02:45:42
18Graph theory / Bipartite graphs / Graph operations / NP-complete problems / Chordal bipartite graph / Chordal graph / Distance-hereditary graph / Matching / Line graph / Split graph / Graph / Cycle

On factorial properties of chordal bipartite graphs Konrad Dabrowski∗ Vadim V. Lozin† Victor Zamaraev‡

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2013-01-06 11:50:35
19Computational complexity theory / Mathematics / NP-complete problems / Theory of computation / Packing problems / Operations research / Approximation algorithms / Knapsack problem / Vertex cover / Bin packing problem / Hardness of approximation / Algorithm

Anna Adamaszek, Andreas Wiese Tutorials: Marvin K¨ unnemann Summer 2014

Add to Reading List

Source URL: resources.mpi-inf.mpg.de

Language: English - Date: 2014-06-04 08:46:15
20Computational complexity theory / Mathematics / NP-complete problems / Theory of computation / Set cover problem / Approximation algorithm / Algorithm / Analysis of algorithms / Bin packing problem / Vertex cover

SET COVERING WITH OUR EYES CLOSED∗ FABRIZIO GRANDONI† , ANUPAM GUPTA‡ , STEFANO LEONARDI§ , PAULI MIETTINEN¶, PIOTR SANKOWSKI§ k , AND MOHIT SINGH∗∗ Abstract. Given a universe U of n elements and a weighted

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2013-03-13 08:17:47
UPDATE